Rank distributions: Frequency vs. magnitude
نویسندگان
چکیده
منابع مشابه
Rank distributions: Frequency vs. magnitude
We examine the relationship between two different types of ranked data, frequencies and magnitudes. We consider data that can be sorted out either way, through numbers of occurrences or size of the measures, as it is the case, say, of moon craters, earthquakes, billionaires, etc. We indicate that these two types of distributions are functional inverses of each other, and specify this link, firs...
متن کاملText mixing shapes the anatomy of rank-frequency distributions.
Natural languages are full of rules and exceptions. One of the most famous quantitative rules is Zipf's law, which states that the frequency of occurrence of a word is approximately inversely proportional to its rank. Though this "law" of ranks has been found to hold across disparate texts and forms of data, analyses of increasingly large corpora since the late 1990s have revealed the existence...
متن کاملNonnegative Rank vs. Binary Rank
Motivated by (and using tools from) communication complexity, we investigate the relationship between the following two ranks of a 0-1 matrix: its nonnegative rank and its binary rank (the log of the latter being the unambiguous nondeterministic communication complexity). We prove that for partial 0-1 matrices, there can be an exponential separation. For total 0-1 matrices, we show that if the ...
متن کامل5 Kapranov Rank Vs . Tropical Rank
We show that determining Kapranov rank of tropical matrices is not only NP-hard over any field but if Diophantine equations over the rational numbers is undecidable, determining Kapranov rank over the rational numbers is also undecidable. We prove that Kapranov rank of tropical matrices is not bounded in terms of tropical rank, answering a question of Develin, Santos, and Sturmfels [4].
متن کاملOn Rank vs. Communication Complexity
This paper concerns the open problem of Lovász and Saks regarding the relationship between the communication complexity of a boolean function and the rank of the associated matrix. We first give an example exhibiting the largest gap known. We then prove two related theorems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS ONE
سال: 2017
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0186015